A Syntactic Operator for Forgetting that Satisfies Strong Persistence
نویسندگان
چکیده
منابع مشابه
When you must forget: Beyond strong persistence when forgetting in answer set programming
Among the myriad of desirable properties discussed in the context of forgetting in Answer Set Programming (ASP), strong persistence naturally captures its essence. Recently, it has been shown that it is not always possible to forget a set of atoms from a program while obeying this property, and a precise criterion regarding what can be forgotten has been presented, accompanied by a class of for...
متن کاملStrong Converse Inequality for a Spherical Operator
In the paper titled as “Jackson-type inequality on the sphere” 2004 , Ditzian introduced a spherical nonconvolution operator Ot,r , which played an important role in the proof of the wellknown Jackson inequality for spherical harmonics. In this paper, we give the lower bound of approximation by this operator. Namely, we prove that there are constants C1 and C2 such that C1ω2r f, t p ≤ ‖Ot,rf − ...
متن کاملOn Forgetting Postulates in Answer Set Programming
Forgetting is an important mechanism for logicbased agent systems. A recent interest has been in the desirable properties of forgetting in answer set programming (ASP) and their impact on the design of forgetting operators. It is known that some subsets of these properties are incompatible, i.e., they cannot be satisfied at the same time. In this paper, we are interested in the question on the ...
متن کاملa generalization of strong causality
در این رساله t_n - علیت قوی تعریف می شود. این رده ها در جدول علیت فضا- زمان بین علیت پایدار و علیت قوی قرار دارند. یک قضیه برای رده بندی آنها ثابت می شود و t_n- علیت قوی با رده های علی کارتر مقایسه می شود. همچنین ثابت می شود که علیت فشرده پایدار از t_n - علیت قوی نتیجه می شود. بعلاوه به بررسی رابطه نظریه دامنه ها با نسبیت عام می پردازیم و ثابت می کنیم که نوع خاصی از فضا- زمان های علی پایدار, ب...
Forgetting in Logic Programs under Strong Equivalence
In this paper, we propose a semantic forgetting for arbitrary logic programs (or propositional theories) under answer set semantics, called HT-forgetting. The HTforgetting preserves strong equivalence in the sense that strongly equivalent logic programs will remain strongly equivalent after forgetting the same set of atoms. The result of an HT-forgetting is always expressible by a logic program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2019
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068419000346